Maximum performance at minimum cost in network synchronization

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maximum Performance at Minimum Cost in Network Synchronization

We consider two optimization problems on synchronization of oscillator networks: maximization of synchronizability and minimization of synchronization cost. We first develop an extension of the well-known master stability framework to the case of non-diagonalizable Laplacian matrices. We then show that the solution sets of the two optimization problems coincide and are simultaneously characteri...

متن کامل

The Minimum Universal Cost Flow in an Infeasible Flow Network

In this paper the concept of the Minimum Universal Cost Flow (MUCF) for an infeasible flow network is introduced. A new mathematical model in which the objective function includes the total costs of changing arc capacities and sending flow is built and analyzed. A polynomial time algorithm is presented to find the MUCF.

متن کامل

Computer Network Time Synchronization using a Low Cost GPS Engine

Accurate and reliable time is necessary for financial and legal transactions, transportation, distribution systems, and many other applications. Time synchronization protocols such as NTP (the Network Time Protocol) have kept clocks of such applications synchronized to each other for many years. Nowadays there are many commercial GPS based NTP time server products at the market but they almost ...

متن کامل

Engineering processive DNA polymerases with maximum benefit at minimum cost

DNA polymerases need to be engineered to achieve optimal performance for biotechnological applications, which often require high fidelity replication when using modified nucleotides and when replicating difficult DNA sequences. These tasks are achieved for the bacteriophage T4 DNA polymerase by replacing leucine with methionine in the highly conserved Motif A sequence (L412M). The costs are min...

متن کامل

A Fuzzy Random Minimum Cost Network Flow Programming Problem

In this paper, a fuzzy random minimum cost flow problem is presented. In this problem, cost parameters and decision variables are fuzzy random variables and fuzzy numbers respectively. The object of the problem is to find optimal flows of a capacitated network. Then, two algorithms are developed to solve the problem based on Er-expected value of fuzzy random variables and chance-constrained pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physica D: Nonlinear Phenomena

سال: 2006

ISSN: 0167-2789

DOI: 10.1016/j.physd.2006.09.007